An Improved Particle Swarm Optimization for Vehicle Routing Problem
نویسندگان
چکیده
Vehicle routing problem is a NP-hard problem in combination optimization problem, It is influenced by many factors, and the process is complex. However, the search space of particle swarm algorithm is limited and prone to precocious phenomenon. In this paper, we based on the original particle swarm optimization, present a new way of location update algorithm (VPSO).VPSO in the process of solving the vehicle routing problem, the individuals are divided into two overlapping subgroups. To enhance the group search ability, each generation of optimal participate a single point mutation and adjust the infeasible solution at the same time. Compared with the original particle swarm algorithm, the experimental results show that, In the medium and small scale examples, VPSO can be more stable and more efficient to obtain optimal vehicle routing problem, improved the success rate of the optimal path search. Keywords—Differential evolution algorithm, Particle swarm algorithm, Vehicle routing problem, Single point mutation.
منابع مشابه
An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملA Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm
Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملImproved Particle Swarm Algorithm to Solve the Vehicle Routing Problem
Vehicle routing problem is a NP hard problem. To solve the premature convergence problem of the particle swarm optimization, an improved particle swarm optimization method was proposed. In the first place, introducing the neighborhood topology, defining two new concepts lepton and hadron. Lepton are particles within the scope of neighborhood, which have weak interaction between each other, so t...
متن کامل